Computer and Modernization ›› 2012, Vol. 1 ›› Issue (9): 140-142.doi: 10.3969/j.issn.1006-2475.2012.09.035

• 算法分析与设计 • Previous Articles     Next Articles

Improved Genetic Algorithm for Multi-constrained 0-1 Knapsack Problem

LV Cong-ying1, HU Ping2, LIU Jiong2   

  1. 1. College of Computer and Information Engineering, Nanyang Institute of Technology, Nanyang 473000, China;2. State Intellectual Property Office of the People’s Republic of China, Beijing 100088, China
  • Received:2012-05-04 Revised:1900-01-01 Online:2012-09-21 Published:2012-09-21

Abstract: he improved strategies for GA are presented, and used to solve the MKP. These main improved strategies are: the solution of the LP-relaxed MKP is used as the initial solution; the repair and local improvement operators are used to avoid the loss of population diversity. By using a standard set of large-sized test data to test the new GA, the results show that the new GA has better performance and converges much faster to better solutions.

Key words: multi-constrained 0-1 knapsack problem, genetic algorithm, LP-relaxed algorithm, repair operator, local optimization